Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
ruler 1 - traduzione in
![Example of a conference room with proportions of a [0, 2, 7, 8, 11] Golomb ruler, making it configurable to 10 different sizes.<ref name="ErdősTurán1941"/>](https://commons.wikimedia.org/wiki/Special:FilePath/Golomb ruler conference room.svg?width=200 "Example of a conference room with proportions of a [0, 2, 7, 8, 11] Golomb ruler, making it configurable to 10 different sizes.<ref name=\"ErdősTurán1941\"/>")
![The perfect circular Golomb rulers (also called [[difference set]]s) with the specified order. (This preview should show multiple concentric circles. If not, click to view a larger version.)](https://commons.wikimedia.org/wiki/Special:FilePath/Perfect circular Golomb rulers.svg?width=200 "The perfect circular Golomb rulers (also called [[difference set]]s) with the specified order. (This preview should show multiple concentric circles. If not, click to view a larger version.)")
![The 24-hour tower clock in [[Venice]], using ''J'' as a symbol for 1](https://commons.wikimedia.org/wiki/Special:FilePath/Clock 24 J.jpg?width=200 "The 24-hour tower clock in [[Venice]], using ''J'' as a symbol for 1")
![[[Hoefler Text]], a typeface designed in 1991, represents the numeral 1 as similar to a small-caps I.](https://commons.wikimedia.org/wiki/Special:FilePath/Mediaevalziffern.svg?width=200 "[[Hoefler Text]], a typeface designed in 1991, represents the numeral 1 as similar to a small-caps I.")
Ex: Eyestrain is the number one complaint of computer users.
![cm}}. Western Han (206 BCE – 8 CE). [[Hanzhong City]], China](https://commons.wikimedia.org/wiki/Special:FilePath/Gilded Bronze Ruler - 1 chi = 231 cm. Western Han (206 BCE - CE 8). Hanzhong City.jpg?width=200 "cm}}. Western Han (206 BCE – 8 CE). [[Hanzhong City]], China")
![A wooden carpenter's rule and other tools found on board the 16th-century [[carrack]] ''[[Mary Rose]]''](https://commons.wikimedia.org/wiki/Special:FilePath/MaryRose-carpentry tools1.jpg?width=200 "A wooden carpenter's rule and other tools found on board the 16th-century [[carrack]] ''[[Mary Rose]]''")
![Archeological Museum]] of [[Istanbul]], Turkey](https://commons.wikimedia.org/wiki/Special:FilePath/Nippur cubit.JPG?width=200 "Archeological Museum]] of [[Istanbul]], Turkey")
![Retractable flexible rule or [[tape measure]]](https://commons.wikimedia.org/wiki/Special:FilePath/TapeMeasure.png?width=200 "Retractable flexible rule or [[tape measure]]")
Definizione
Wikipedia
In mathematics, a Golomb ruler is a set of marks at integer positions along a ruler such that no two pairs of marks are the same distance apart. The number of marks on the ruler is its order, and the largest distance between two of its marks is its length. Translation and reflection of a Golomb ruler are considered trivial, so the smallest mark is customarily put at 0 and the next mark at the smaller of its two possible values. Golomb rulers can be viewed as a one-dimensional special case of Costas arrays.
The Golomb ruler was named for Solomon W. Golomb and discovered independently by Sidon (1932) and Babcock (1953). Sophie Piccard also published early research on these sets, in 1939, stating as a theorem the claim that two Golomb rulers with the same distance set must be congruent. This turned out to be false for six-point rulers, but true otherwise.
There is no requirement that a Golomb ruler be able to measure all distances up to its length, but if it does, it is called a perfect Golomb ruler. It has been proved that no perfect Golomb ruler exists for five or more marks. A Golomb ruler is optimal if no shorter Golomb ruler of the same order exists. Creating Golomb rulers is easy, but proving the optimal Golomb ruler (or rulers) for a specified order is computationally very challenging.
Distributed.net has completed distributed massively parallel searches for optimal order-24 through order-28 Golomb rulers, each time confirming the suspected candidate ruler.
Currently, the complexity of finding optimal Golomb rulers (OGRs) of arbitrary order n (where n is given in unary) is unknown. In the past there was some speculation that it is an NP-hard problem. Problems related to the construction of Golomb rulers are provably shown to be NP-hard, where it is also noted that no known NP-complete problem has similar flavor to finding Golomb rulers.
